Localized Codegree Conditions for Tight Hamilton Cycles in 3-Uniform Hypergraphs
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 30 March 2021Accepted: 24 September 2021Published online: 06 January 2022Keywordshypergraphs, Eulerian and Hamiltonian graphs, Absorption MethodAMS Subject Headings05C65, 05C45Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society for Industrial Applied MathematicsCODEN: sjdmec
منابع مشابه
Packing Tight Hamilton Cycles in Uniform Hypergraphs
We say that a k-uniform hypergraph C is a Hamilton cycle of type `, for some 1 ≤ ` ≤ k, if there exists a cyclic ordering of the vertices of C such that every edge consists of k consecutive vertices and for every pair of consecutive edges Ei−1, Ei in C (in the natural ordering of the edges) we have |Ei−1 \ Ei| = `. We define a class of ( , p)-regular hypergraphs, that includes random hypergraph...
متن کاملTight Hamilton cycles in random uniform hypergraphs
In this paper we show that e/n is the sharp threshold for the existence of tight Hamilton cycles in random k-uniform hypergraphs, for all k ≥ 4. When k = 3 we show that 1/n is an asymptotic threshold. We also determine thresholds for the existence of other types of Hamilton cycles.
متن کاملCodegree Thresholds for Covering 3-Uniform Hypergraphs
Given two 3-uniform hypergraphs F and G = (V,E), we say that G has an F -covering if we can cover V with copies of F . The minimum codegree of G is the largest integer d such that every pair of vertices from V is contained in at least d triples from E. Define c2(n, F ) to be the largest minimum codegree among all n-vertex 3-graphs G that contain no F -covering. Determining c2(n, F ) is a natura...
متن کاملMinimum codegree threshold for Hamilton ℓ-cycles in k-uniform hypergraphs
Article history: Received 9 June 2014 Available online xxxx
متن کاملTight Hamilton cycles in random hypergraphs
We give an algorithmic proof for the existence of tight Hamilton cycles in a random r-uniform hypergraph with edge probability p = n−1+ε for every ε > 0. This partly answers a question of Dudek and Frieze [Random Structures Algorithms], who used a second moment method to show that tight Hamilton cycles exist even for p = ω(n)/n (r ≥ 3) where ω(n) → ∞ arbitrary slowly, and for p = (e + o(1))/n (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2022
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/21m1408531